We present an efficient routing approach for delivering packets in complexnetworks. On delivering a message from a node to a destination, a node forwardsthe message to a neighbor by estimating the waiting time along the shortestpath from each of its neighbors to the destination. This projected waiting timeis dynamical in nature and the path through which a message is delivered wouldbe adapted to the distribution of messages in the network. Implementing theapproach on scale-free networks, we show that the present approach performsbetter than the shortest-path approach and another approach that takes intoaccount of the waiting time only at the neighboring nodes. Key features innumerical results are explained by a mean field theory. The approach has themerit that messages are distributed among the nodes according to thecapabilities of the nodes in handling messages.
展开▼
